A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
نویسندگان
چکیده
Recently, Nenadić et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encrypted signatures (VRES) to guarantee properties such as strong fairness and non-repudiation, among others. In this paper, we illustrate how an extended logic of beliefs can be helpful to analyze in a formal manner these security properties. This approach requires the previous definition of some novel constructions to deal with evidences exchanged by parties during the protocol execution. The study performed within this framework reveals the lack of non-repudiation in RSA-CEGD and points out some other weaknesses.
منابع مشابه
Cryptanalysis of the RSA-CEGD protocol
Recently, Nenadić et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encrypted signatures (VRES) to guarantee properties such as strong fairness and non-repudiation, among others. In this paper, we demonstrate how this protocol cannot achieve fairness by presenting a severe attack and also point...
متن کاملUnfairness of a protocol for certified delivery
Recently, Nenadić et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encrypted signatures (VRES) to guarantee properties such as strong fairness and non-repudiation, among others. In this paper, we demonstrate how this protocol cannot achieve fairness by presenting a severe attack and also point...
متن کاملNew Fair Payment Protocols
Fair payment protocol is designed to guarantee fairness in electronic purchasing, that is, no party can falsely deny involvement in the transaction or having sent/received the specific items/payment. In this paper we first present an efficient fair payment protocol providing invisibility of TTP, timeliness, and standard RSA signatures as the final non-repudiation evidences. Then we present a se...
متن کاملFormal Verification of a Timed Non-Repudiation Protocol
Fairness of non-repudiation is naturally expressed as a liveness specification. We formalize this idea by using the process algebra CSP to analyze the well-known Zhou-Gollmann protocol. We here model and verify a variant of the ZG protocol that includes a deadline (timestamp) for completion of the protocol, after which an agent can no longer initiate the recovery protocol with the TTP to get ho...
متن کاملAn efficient non-repudiation billing protocol in heterogeneous 3G-WLAN networks
The wireless communication with delivering variety of services to users is growing rapidly in recent years. The third generation of cellular networks (3G), and local wireless networks (WLAN) are the two widely used technologies in wireless networks. 3G networks have the capability of covering a vast area; while, WLAN networks provide higher transmission rates with less coverage. Since the two n...
متن کامل